منابع مشابه
Parsing for Semidirectional Lambek Grammar is NP-Complete
We study the computational complexity of the parsing problem of a variant of Lambek Categorial Grammar that we call semidirectional. In semidirectional Lambek calculus SD[ there is an additional nondirectional abstraction rule allowing the formula abstracted over to appear anywhere in the premise sequent's left-hand side, thus permitting non-peripheral extraction. SD[ grammars are able to gener...
متن کاملRepetition-Free Derivability from a Regular Grammar is NP-Hard
We prove the NP-hardness of the problem whether a given word can be derived from a given regular grammar without repeated occurrence of any nonterminal.
متن کاملParsing for Semidirectional Lambek Grammar is NP-Complete
We study the computational complexity of the parsing problem of a variant of Lambek Categorial Grammar that we call semidirectional. In semidirectional Lambek calculus SDL there is an additional nondirectional abstraction rule allowing the formula abstracted over to appear anywhere in the premise sequent’s left-hand side, thus permitting non-peripheral extraction. SDL grammars are able to gener...
متن کاملEvaluation of immunogenicity of recombinant influenza nucleoprotein (NP) for universal vaccine
Background: Influenza vaccines based on conserved proteins are being developed persistently. The conserved protein vaccines based on Nucleoprotein (NP) are highly protected vaccines against influenza viruses that can be used as a Universal vaccine. Aluminum hydroxide (Alum) is the most common adjuvant used in vaccine formulation to improve immunization by altering the epitopes’ folds. However, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Universal Language
سال: 2012
ISSN: 1598-6381
DOI: 10.22425/jul.2012.13.2.119